AUC-Maximizing Ensembles through Metalearning

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AUC Maximizing Support Vector Learning

The area under the ROC curve (AUC) is a natural performance measure when the goal is to find a discriminative decision function. We present a rigorous derivation of an AUC maximizing Support Vector Machine; its optimization criterion is composed of a convex bound on the AUC and a margin term. The number of constraints in the optimization problem grows quadratically in the number of examples. We...

متن کامل

Classification through Maximizing Density

This paper presents a novel method for classification, which makes use of the models built by the lattice machine (LM) [1, 3]. The LM approximates data resulting in, as a model of data, a set of hyper tuples that are equilabelled, supported and maximal. The method presented in this paper uses the LM model of data to classify new data with a view to maximising the density of the model. Experimen...

متن کامل

Boosting in the Limit: Maximizing the Margin of Learned Ensembles

The “minimum margin” of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has shown that the Adaboost algorithm is particularly effective at producing ensembles with large minimum margins, and theory suggests that this may account for its success at reducing generalization error. We note, however, that the ...

متن کامل

Metalearning for Feature Selection

A general formulation of optimization problems in which various candidate solutions may use different feature-sets is presented, encompassing supervised classification, automated program learning and other cases. A novel characterization of the concept of a “good quality feature” for such an optimization problem is provided; and a proposal regarding the integration of quality based feature sele...

متن کامل

Learning to rank by maximizing the AUC with linear programming for problems with binary output

Ranking is a popular machine learning problem that has been studied extensively for more then a decade. Typical machine learning algorithms are generally built to optimize predictive performance (usually measured in accuracy) by minimizing classification error. However, there are many real world problems where correct ordering of instances is of equal or greater importance than correct classifi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The International Journal of Biostatistics

سال: 2016

ISSN: 2194-573X,1557-4679

DOI: 10.1515/ijb-2015-0035